Two proofs in combinatorial number theory
نویسندگان
چکیده
منابع مشابه
Combinatorial Number Theory
Background. The integer distance graph G(Z, D) with distance set D = {d1, d2, . . .} has the set of integers Z as the vertex set and two vertices x, y ∈ Z are adjacent if and only if |x − y| ∈ D. The integer distance graphs (under Euclidean norm) were first systematically studied by Eggleton–Erdős–Skilton in 1985 [12, 13], and have been investigated in many ways [50, 56, 57, 61]. One of main go...
متن کاملGroups in Combinatorial Number Theory
In combinatorial number theory, there are many topics related to group structure. Even for abelian or cyclic groups, there are some very challenging unsolved conjectures. In this talk we give a survey of problems, results and methods in several fields of combinatorial number theory. The topics include sumsets in additive combinatorics, Snevily’s conjecture and Latin transversals, covers of the ...
متن کاملCombinatorics 3 - Combinatorial Number Theory
“Combinatorial number theory”, in very loose terms, can be described as an area of mathematics which is a cross between combinatorics and number theory. More precisely, the area concerns structures of integers (or similar sets), with some number theoretic properties, which can be studied mainly by combinatorial means, rather than, for example, by algebraic methods. This area really only truly e...
متن کاملCombinatorial Problems in Geometry and Number Theory
In a previous paper (given at the International Congress of Mathematicians at Nice 1970) entitled "On the application of combinatorial analysis to number theory geometry and analysis", I discussed many combinatorial results and their applications . I will refer to this paper as I (as much as possible I will try to avoid overlap with this paper) . First I discuss those problems mentioned in I wh...
متن کاملA nonstandard technique in combinatorial number theory
In the last few years many results in combinatorial number theory have been proved by means of nonstandard techniques. The aim of our talk is to present some of these techniques by means of some selected examples of applications. A particular attention will be given to the study of the following kind of problems: given a diophantine equation P (x1, ..., xn) = 0 we say that this equation is part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1985
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1985-0766553-0